ON THE RELAXED HYBRID-EXTRAGRADIENT METHOD FOR SOLVING CONSTRAINED CONVEX MINIMIZATION PROBLEMS IN HILBERT SPACES
نویسندگان
چکیده
منابع مشابه
A General Iterative Method for Constrained Convex Minimization Problems in Hilbert Spaces
It is well known that the gradient-projection algorithm plays an important role in solving constrained convex minimization problems. In this paper, based on Xu’s method [Xu, H. K.: Averaged mappings and the gradient-projection algorithm, J. Optim. Theory Appl. 150, 360-378(2011)], we use the idea of regularization to establish implicit and explicit iterative methods for finding the approximate ...
متن کاملStrong Convergence of the Halpern Subgradient Extragradient Method for Solving Variational Inequalities in Hilbert Spaces
In this paper, we combine the subgradient extragradient method with the Halpern method for finding a solution of a variational inequality involving a monotone Lipschitz mapping in Banach spaces. By using the generalized projection operator and the Lyapunov functional introduced by Alber, we prove a strong convergence theorem. We also consider the problem of finding a common element of the set o...
متن کاملA Bundle Method for Solving Convex Non-smooth Minimization Problems
Numerical experiences show that bundle methods are very efficient for solving convex non-smooth optimization problems. In this paper we describe briefly the mathematical background of a bundle method and discuss practical aspects for the numerical implementation. Further, we give a detailed documentation of our implementation and report about numerical tests.
متن کاملCanonical Primal-Dual Method for Solving Non-convex Minimization Problems
A new primal-dual algorithm is presented for solving a class of non-convex minimization problems. This algorithm is based on canonical duality theory such that the original non-convex minimization problem is first reformulated as a convex-concave saddle point optimization problem, which is then solved by a quadratically perturbed primal-dual method. Numerical examples are illustrated. Comparing...
متن کاملA Bundle Interior Proximal Method for Solving Convex Minimization Problems
In this paper we extend the standard bundle proximal method for finding the minimum of a convex not necessarily differentiable function on the nonnegative orthant. The strategy consists in approximating the objective function by a piecewise linear convex function and using distance–like functions based on second order homogeneous kernels. First we prove the convergence of this new bundle interi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Taiwanese Journal of Mathematics
سال: 2013
ISSN: 1027-5487
DOI: 10.11650/tjm.17.2013.2567